Choosing Improved Initial Values for Polynomial Zerofinding in Extended Newbery Method to Obtain Convergence

In all polynomial zerofinding algorithms, a good convergence requires a very good initial approximation of the exact roots. The objective of the work is to study the conditions for determining the initial approximations for an iterative matrix zerofinding method. The investigation is based on the Newbery’s matrix construction which is similar to Fiedler’s construction associated with a characteristic polynomial. To ensure that convergence to both the real and complex roots of polynomials can be attained, threemethods are employed. It is found that the initial values for the Fiedler’s companionmatrix which is supplied by the Schmeisser’s method give a better approximation to the solution in comparison to when working on these values using the Schmeisser’s construction towards finding the solutions. In addition, empirical results suggest that a good convergence can still be attained when an initial approximation for the polynomial root is selected away from its real value while other approximations should be sufficiently close to their real values. Tables and figures on the errors that resulted from the implementation of the method are also given.